On $\sum \sb{n}\leq \sb{x}(\sigma \sp{\ast} (n))$ and $\sum \sb{n}\leq \sb{x}(\phi\sp{\ast} (n))$
نویسندگان
چکیده
منابع مشابه
Sum List Coloring 2*n Arrays
A graph is f -choosable if for every collection of lists with list sizes specified by f there is a proper coloring using colors from the lists. The sum choice number is the minimum over all choosable functions f of the sum of the sizes in f . We show that the sum choice number of a 2 × n array (equivalent to list edge coloring K2,n and to list vertex coloring the cartesian product K22Kn) is n2 ...
متن کاملOn the sum of the first n primes
In this note, we show that the set of n such that the arithmetic mean of the first n primes is an integer is of asymptotic density zero. We use the same method to show that the set of n such the sum of the first n primes is a square is also of asymptotic density zero. We also prove that both the arithmetic mean of the first n primes as well as the square root of the sum of the first n primes ar...
متن کاملOn the Edge-Difference and Edge-Sum Chromatic Sum of the Simple Graphs
For a coloring $c$ of a graph $G$, the edge-difference coloring sum and edge-sum coloring sum with respect to the coloring $c$ are respectively $sum_c D(G)=sum |c(a)-c(b)|$ and $sum_s S(G)=sum (c(a)+c(b))$, where the summations are taken over all edges $abin E(G)$. The edge-difference chromatic sum, denoted by $sum D(G)$, and the edge-sum chromatic sum, denoted by $sum S(G)$, a...
متن کاملOn a Conjecture of Cusick Concerning the Sum of Digits of n and n + t
For a nonnegative integer t, let ct be the asymptotic density of natural numbers n for which s(n + t) ≥ s(n), where s(n) denotes the sum of digits of n in base 2. We prove that ct > 1/2 for t in a set of asymptotic density 1, thus giving a partial solution to a conjecture of T. W. Cusick stating that ct > 1/2 for all t. Interestingly, this problem has several equivalent formulations, for exampl...
متن کاملMod sum graph labelling of Hm, n and Kn
The mod sum number p( G) of a connected graph G is the minimum number of isolated vertices required to transform G into a mod sum graph. It is known that the mod sum number is greater than zero for wheels, Wn, when n > 4 and for the complete graphs, Kn when n 2: 2. In this paper we show that p( Hm,n) > 0 for n > m ;::: 3. Vie show further that P(K2) = P(K3) = 1 while p(Kn) = n for n ;::: 4. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1973
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1973-0319922-9